Shortest path problem

Results: 829



#Item
261Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
262Graph / Tree / Shortest path problem / Degree / Planar separator theorem / Chordal graph / Graph theory / Mathematics / Theoretical computer science

An effective 3-in-1 keyword search method over heterogeneous data sources

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-09-26 08:02:06
263Network theory / Shortest path problem / Curvature / Motion planning / Mathematics / Applied mathematics / Theoretical computer science

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Bounded-Curvature Path Normalization Jonathan Backer∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2006-06-29 12:06:02
264NP-complete problems / Network theory / Shortest path problem / Geodesic / Travelling salesman problem / Motion planning / Trigonometric functions / NP / Curvature / Theoretical computer science / Mathematics / Computational complexity theory

CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
265Operations research / Graph theory / Mathematical optimization / NP-complete problems / Network theory / Algorithm / Shortest path problem / Dynamic programming / Graph / Theoretical computer science / Mathematics / Applied mathematics

ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2005-05-26 20:09:03
266Topological graph theory / Network theory / Planar graphs / Algebraic graph theory / Matroid theory / Shortest path problem / Dual graph / Graph embedding / Matroid / Graph theory / Mathematics / Theoretical computer science

Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-06-23 07:19:49
267Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Theoretical computer science / Graph theory / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:24
268Network theory / Routing algorithms / Planar separator theorem / Shortest path problem / Distance / Induced path / Tree / NP-complete problems / Path decomposition / Graph theory / Mathematics / Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
269Theoretical computer science / Mathematical optimization / Network theory / Operations research / Motion planning / Shortest path problem / Visibility graph / Dynamic programming / Pareto efficiency / Mathematics / Applied mathematics / Graph theory

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:00:23
270Network theory / Search algorithms / Graph theory / Communication / Communication complexity / Quantum complexity theory / Shortest path problem / Randomized algorithm / Breadth-first search / Theoretical computer science / Mathematics / Applied mathematics

114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
UPDATE